A logic-based analysis of Dempster-Shafer theory
نویسندگان
چکیده
منابع مشابه
A logic-based analysis of Dempster-Shafer theory
Dempster-Shafer (DS) theory is formulated in terms of propositional logic, using the implicit notion of provability underlying DS theory. Dempster-Shafer theory can be modeled in terms of propositional logic by the tuple (~, p), where S is a set of propositional clauses and p is an assignment of mass to each clause Ei c ~. It is shown that the disjunction of minimal support clauses for a clause...
متن کاملA Dempster-Shafer theory inspired logic
Issues of formalisirig and interpreting epistemic uncertainty have always played a prominent role in Artificial Intelligence. The Dempster-Shafer (DS) theory of partial beliefs is one of the most-well known formalisms to address the partial knowledge. Similarly to the DS theory, which is a généralisation of the classical probability theory, fuzzy logie provides an alternative reasoning apparatu...
متن کاملDempster-Shafer theory framed in modal logic
In this paper, the modal logic interpretation of plausibility and belief measures on an arbitrary universe of discourse, as proposed by Harmanec et al., is further developed by employing notions from set-valued analysis. In a model of modal logic, a multivalued mapping is constructed from the accessibility relation and a mapping determined by the value assignment function. This multivalued mapp...
متن کاملThe Dempster-Shafer Theory
The initial work introducing Dempster-Shafer (D-S) theory is found in Dempster (1967) and Shafer (1976). Since its introduction the very name causes confusion, a more general term often used is belief functions (both used intermittently here). Nguyen (1978) points out, soon after its introduction, that the rudiments of D-S theory can be considered through distributions of random sets. More furt...
متن کاملDempster-Shafer vs. Probabilistic Logic
The combination of evidence in Dempster-Shafer theory is compared with the combination of evidence in probabilistic logic. Sufficient conditions are stated for these two methods to agree. It is then shown that these conditions are minimal in the sense that disagreement can occur when any one of them is removed. An example is given in which the traditional assumption of conditional independence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 1990
ISSN: 0888-613X
DOI: 10.1016/0888-613x(90)90016-u